Joint Successive Cancellation Decoding of Polar Codes over Intersymbol Interference Channels
نویسندگان
چکیده
Polar codes are a class of capacity-achieving codes for the binary-input discrete memoryless channels (B-DMCs). However, when applied in channels with intersymbol interference (ISI), the codes may perform poorly with BCJR equalization and conventional decoding methods. To deal with the ISI problem, in this paper a new joint successive cancellation (SC) decoding algorithm is proposed for polar codes in ISI channels, which combines the equalization and conventional decoding. The initialization information of the decoding method is the likelihood functions of ISI codeword symbols rather than the codeword symbols. The decoding adopts recursion formulas like conventional SC decoding and is without iterations. This is in contrast to the conventional iterative algorithm which performs iterations between the equalizer and decoder. In addition, the proposed SC trellis decoding can be easily extended to list decoding which can further improve the performance. Simulation shows that the proposed scheme significantly outperforms the conventional decoding schemes in ISI channels.
منابع مشابه
Implementation of Polar Code Decoders
In this report, we review the construction of polar codes and we briefly present the main results that lead to the conclusion that polar codes are capacity achieving over binaryinput discrete memoryless channels. Moreover, we discuss a more sophisticated variant of successive cancellation decoding, namely list successive cancellation decoding, that aims to improve the finite-length performance ...
متن کاملCapacity-Achievability of Polar Codes under Successive Cancellation List Decoding
Polar codes under successive cancellation decoding proposed by Ar{\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Ar{\i}kan. The performance of the successive cancellation list decoder is encou...
متن کاملSpatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels
Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of binary memoryless channels. This is facilitated by the “threshold saturation” effect whereby the belief-propagation (BP) threshold of the spatially-coupled ensemble is boosted to the maximum a-posteriori (MAP)...
متن کاملJoint intersymbol and multiple-access interference suppression algorithms for CDMA systems
Two promising classes of techniques are developed for e cient multiuser detection in codedivision multiple-access (CDMA) communication systems subject to fading due to time-varying multipath propagation. Both are designed to jointly suppress both intersymbol and multipleaccess interference inherent in such systems, and exploit all available time and frequency diversity. The rst is a family of l...
متن کاملRecursive descriptions of polar codes
Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. This description allows an easy development of the first two algorithms for arbitrary polarizing kernels. Hardware architectures for these decoding algorithms are also describ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1404.3001 شماره
صفحات -
تاریخ انتشار 2014